Boting Yang's Home Page

Dr. Boting Yang
Professor
Department of Computer Science
University of Regina
Regina, Saskatchewan
Canada, S4S 0A2


Office :  CW 308.7
Phone :  306-585-4774
Fax :  306-585-4745
Email :  boting.yang@uregina.ca

Research Interests:

Design and analysis of algorithms, graph theory, combinatorial optimization, computational geometry.

Selected Papers (2011 - ):

  • Y. Xue, B. Yang, S. Zilles, and L. Wang, Fast Searching on Cactus Graphs, Journal of Combinatorial Optimization, Accepted February 22, 2023. DOI: 10.1007/s10878-023-01012-x.

  • B. Yang, One-visibility cops and robber on trees: Optimal cop-win strategies, Theoretical Computer Science, Vol. 928, pp.27 - 47, 2022. https://doi.org/10.1016/j.tcs.2022.06.011.

  • Y. Xue, B. Yang, and S. Zilles, A simple method for proving lower bounds in the zero-visibility cops and robber game, Journal of Combinatorial Optimization, Vol. 43, pp.1545 - 1570, 2022. DOI: 10.1007/s10878-021-00710-8.

  • O. Diner, D. Dyer, and B. Yang, Four-searchable biconnected outerplanar graphs, Discrete Applied Mathematics, Vol.306, pp.70 - 82, 2022. https://doi.org/10.1016/j.dam.2021.09.011.

  • B. Yang, and T. Akter, One-visibility cops and robber on trees, Theoretical Computer Science, Vol. 886, pp.139 - 156, 2021. https://doi.org/10.1016/j.tcs.2021.07.038.

  • Z. Gao, and B. Yang, The One-Cop-Moves Game on Planar Graphs, Journal of Combinatorial Optimization, Vol. 42, pp.442 - 475, 2021. DOI: 10.1007/s10878-019-00417-x.

  • L. Wang, and B. Yang, The one-cop-moves game on graphs with some special structures, Theoretical Computer Science, Vol. 847, pp.17 - 26, 2020. https://doi.org/10.1016/j.tcs.2020.09.033.

  • S. Butler, C. Erickson, S. Fallat, H. T. Hall, B. Kroschel, J. C.-H. Lin, B. Shader, N. Warnberg, and B. Yang, Properties of a $q$-Analogue of Zero Forcing, Graphs and Combinatorics, Vol. 36, pp. 1401 - 1419, 2020. DOI: 10.1007/s00373-020-02208-2

  • L. Wang, and B. Yang, Positive Semidefinite Zero Forcing Numbers of Two Classes of Graphs, Theoretical Computer Science, Vol. 786, pp.44 - 54, 2019. https://doi.org/10.1016/j.tcs.2018.05.009.

  • M. Adm, S. Fallat, K. Meagher, S. Naserasr, S. Plosker, and B. Yang, Achievable multiplicity partitions in the inverse eigenvalue problem of a graph, Special Matrices, Vol. 7, pp.276 - 290, 2019. DOI: 110.1515/spma-2019-0022.

  • B. Yang, R. Zhang, Y. Cao, and F. Zhong, Search Numbers in Networks with Special Topologies, Journal of Interconnection Networks, Vol. 19, pp.1 - 34, 2019. DOI: 10.1142/S0219265919400048.

  • Y. Xue, B. Yang, F. Zhong, and S. Zilles, The Fast Search Number of a Complete k-partite Graph, Algorithmica, Vol. 80, pp.3959 - 3981, 2018. DOI: 10.1007/s00453-018-0456-z.

  • R. Bergen, S. Fallat, A. Gorr, F. Ihringer, K. Meagher, A. Purdy, B. Yang, and G. Yu, Infection in Hypergraphs, Discrete Applied Mathematics, Vol.237, pp.43 - 56, 2018. https://doi.org/10.1016/j.dam.2017.11.012.

  • M. Adm, R. Bergen, F. Ihringer, S. Jaques, K. Meagher, A. Purdy, and B. Yang, Ovoids of Generalized Quadrangles of Order $(q, q^2-q)$ and Delsarte Cocliques in Related Strongly Regular Graphs, Journal of Combinatorial Design, Vol.26, pp.249 - 263, 2018. https://doi.org/10.1002/jcd.21598.

  • S. Fallat, K. Meagher, A. Soltani, and B. Yang, Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing, Theoretical Computer Science, Vol. 734, pp.119 - 130, 2018. https://doi.org/10.1016/j.tcs.2017.08.018.

  • Y. Xue, and B. Yang, The fast search number of a Cartesian product of graphs, Discrete Applied Mathematics, Vol.224, pp.106 - 119, 2017.

  • B. Yang, Lower bounds for positive semidefinite zero forcing and their applications, Journal of Combinatorial Optimization. Vol. 33, pp.81 - 105, 2017.

  • J. Jia, B. Yang, and S. Li, On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices, Computers and Mathematics with Applications. Vol. 71, pp.1036 - 1044, 2016.

  • S. Fallat, K. Meagher, and B. Yang, On the complexity of the positive semidefinite zero forcing number, Linear Algebra and its Applications. Vol. 491, pp.101 - 122, 2016.

  • I. Kanj, G. Lin, T. Liu, W. Tong, G. Xia, J. Xu, B. Yang, F. Zhang, P. Zhang, and B. Zhu, Improved parameterized and exact algorithms for cut problems on trees, Theoretical Computer Science, Vol. 607, part 3, pp.455 - 470, 2015.

  • B. Yang and W. Hamilton, The Optimal Capture Time of the One-Cop-Moves Game, Theoretical Computer Science, Vol. 588, pp.96 - 113, 2015.

  • D. Dereniowski, D. Dyer, R. Tifenbach, and B. Yang, The complexity of zero-visibility cops and robber, Theoretical Computer Science, Vol. 607, part 2, pp.135 - 148, 2015.

  • D. Dereniowski, D. Dyer, R. Tifenbach, and B. Yang, Zero-Visibility Cops & Robber and the Pathwidth of a Graph, Journal of Combinatorial Optimization, Vol. 29, pp.541 - 564, 2015

  • D. Kirkpatrick, B. Yang and S. Zilles, A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors, International Journal of Computational Geometry and Applications, Vol. 24, pp.225 - 236, 2014.

  • Z. Chen, B. Fu, R. Goebel, G. Lin, W. Tong, J. Xu, B. Yang, Z. Zhao and B. Zhu, On the approximability of the exemplar adjacency number problem for genomes with gene repetitions, Theoretical Computer Science, Vol. 550, pp.59 - 65, 2014.

  • R. Samei, P. Semukhin, B. Yang and S. Zilles, Algebraic Methods Proving Sauer's Bound for Teaching Complexity, Theoretical Computer Science, Vol. 558, pp.35 - 50, 2014.

  • B. Yang, Fast-mixed searching and related problems on graphs, Theoretical Computer Science, Vol. 507, pp.100 - 113, 2013.

  • B. Yang, Euclidean chains and their shortcuts, Theoretical Computer Science, Vol. 497, pp.55 - 67, 2013.

  • Y. Zou, G.H. Huang and B.T. Yang, Water resources management under multi-parameter interactions: A factorial multi-stage stochastic programming approach, Omega -- The International Journal of Management Science, Vol. 41, Issue 3, pp.559 - 573, 2013.

  • S. Wang, G.H. Huang and B.T. Yang, An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management, Environmental Modelling & Software, Vol. 29, Issue 1, pp.24 - 36, 2012.

  • B. Yang, Fast edge-searching and fast searching on graphs, Theoretical Computer Science, Vol. 412, pp.1208 - 1219, 2011.

  • L. Cai and B. Yang, Parameterized Complexity of Even/Odd Subgraph Problems, Journal of Discrete Algorithms, Vol. 9, No.3, pp.231 - 240, 2011.

  • S. Bereg, M. Jiang, B. Yang and B. Zhu, On the Red/Blue Spanning Tree Problem, Theoretical Computer Science, Vol. 412, pp.2459 - 2467, 2011.

  • D. Stanley and B. Yang, Fast searching games on graphs, Journal of Combinatorial Optimization, Vol. 22, No. 4, pp.763 - 777, 2011.

    • Editorship:

  • Associate Editor, Discrete Mathematics, Algorithms and Applications
  • Editorial Board, Algorithms
  • Guest Editor, Theoretical Computer Science, Volume 607, Part 1, 2015.
  • Editor, Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, Volume 8546, Springer, 2014.
  • Guest Editor, Theoretical Computer Science, Volume 410, Issue 52, 2009.
  • Guest Editor, Journal of Combinatorial Optimization, Volume 18, Number 3, 2009.
  • Guest Editor, Journal of Combinatorial Optimization, Volume 18, Number 4, 2009.
  • Editor, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Volume 5165, Springer, 2008.

    • PC members in recent events:

  • COCOON 2023
  • FCT 2023
  • COCOA 2023
  • COCOON 2022
  • AAIM 2022
  • AAIM 2021
  • COCOA 2021
  • COCOON 2020
  • COCOA 2020
  • TAMC 2020
  • AAIM 2020
  • COCOA 2019
  • COCOON 2019
  • COCOA 2018
  • COCOON 2018
  • FAW 2018
  • GRASCan 2018

    • Current Courses:

  • UR courses

    • Useful Links:

  • Department of Computer Science, University of Regina
  • UR VPN network, Central Authentication Service (CAS)
  • UR-WebMail, CS-WebMail, UR-gwweb